доказательство общей правильности
—
[http://www.iks-media.ru/glossary/index.html?glossid=2400324]
Англо-русский словарь нормативно-технической терминологии. academic.ru. 2015.
Correctness (computer science) — In theoretical computer science, correctness of an algorithm is asserted when it is said that the algorithm is correct with respect to a specification. Functional correctness refers to the input output behaviour of the algorithm (i.e., for each… … Wikipedia
доказательство общей правильности — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN total correctness, proof of … Справочник технического переводчика
Loop variant — In computer science, a loop variant is a mathematical function defined on the state space of a computer program having the property that each iteration of a loop (given its invariant) strictly decreases its value with respect to a well founded… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
Dining cryptographers protocol/Rewrite — Problem Statement Dining Cryptographers A group of cryptographers is enjoying dinner at a local restaurant. Upon requesting their bill, the cryptographers are surprised to learn from their host that payment for the dinner has already been… … Wikipedia
Termination analysis — In computer science, a termination analysis is program analysis which attempts to determine whether the evaluation of a given program will definitely terminate. Because the halting problem is undecidable, termination analysis cannot work… … Wikipedia
Componente fuertemente conexo — Un grafo dirigido, y sus componentes fuertemente conexos. En la Teoría de los grafos, un grafo dirigido es llamado fuertemente conexo si para cada par de vértices u y v existe un camino de u hacia v y un camino de v hacia u. Los componentes… … Wikipedia Español
Gödel numbering for sequences — A Gödel numbering for sequences provides us an effective way to represent each finite sequence of natural numbers as a single natural number. Of course, the embedding is surely possible set theoretically, but the emphasis is on the effectiveness… … Wikipedia
metaphysics — /met euh fiz iks/, n. (used with a sing. v.) 1. the branch of philosophy that treats of first principles, includes ontology and cosmology, and is intimately connected with epistemology. 2. philosophy, esp. in its more abstruse branches. 3. the… … Universalium
Law, Crime, and Law Enforcement — ▪ 2006 Introduction Trials of former heads of state, U.S. Supreme Court rulings on eminent domain and the death penalty, and high profile cases against former executives of large corporations were leading legal and criminal issues in 2005.… … Universalium
